Proving properties of committed choice logic programs
نویسندگان
چکیده
منابع مشابه
Proving Properties of Actor Programs Using Temporal Logic
meth perform (message) if (ask tail isEmpty) then let value = (ask head (ask message getSelector) (ask message getParams)) in (send (ask message getReturnAddress) return (value)) else let newTag = create(Tag) in (let mess = ask message copywithTagReturnTo (newTag message) in (send tail perform (m); send (ask message getReturnaddress) returnWithReqiredReceipts(nil newTag))) ... endDef Figure 9: ...
متن کاملProving Properties of Constraint Logic Programs by Eliminating Existential Variables
We propose a method for proving rst order properties of constraint logic programs which manipulate nite lists of real numbers. Constraints are linear equations and inequations over reals. Our method consists in converting any given rst order formula into a strati ed constraint logic program and then applying a suitable unfold/fold transformation strategy that preserves the perfect model. Our st...
متن کاملProving Properties of Actor Programs Using Temporal Logic
defActor Set (head tail) ... meth perform (message) if (ask tail isEmpty) then let value = (ask head (ask message getSelector) (ask message getParams)) in (send (ask message getReturnAddress) return (value)) else let newTag = create(Tag) in (let mess = ask message copywithTagReturnTo (newTag message) in (send tail perform (m); send (ask message getReturnaddress) returnWithReqiredReceipts(nil ne...
متن کاملProving Properties of Logic Programs by Abstract Diagnosis
We show how declarative diagnosis techniques can be extended to cope with verification of operational properties, such as computed answers, and of abstract properties, such as types and groundness dependencies. The extension is achieved by using a simple semantic framework, based on abstract interpretation. The resulting technique (abstract diagnosis) leads to elegant bottom-up and top-down ver...
متن کاملProving Termination of Logic Programs by Exploiting Term Properties
In this paper semi-linear norms, a class of functions to weight the terms occurring in a program, are defined and studied. All the functions in this class have the nice property of allowing a syntactical characterization of rigid terms, that is terms whose weight does not change under substitution. Based on these norms, a general proof method for termination of pure Prolog programs can be adapt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1989
ISSN: 0743-1066
DOI: 10.1016/0743-1066(89)90010-1